Preferred History Semantics for Iterated Updates
نویسندگان
چکیده
We give a semantics to iterated update by a preference relation on possible developments. An iterated update is a sequence of formulas, giving (incomplete) information about successive states of the world. A development is a sequence of models, describing a possible trajectory through time. We assume a principle of inertia and prefer those developments, which are compatible with the information, and avoid unnecessary changes. The logical properties of the updates defined in this way are considered, and a representation result is proved.
منابع مشابه
Fixpoints and Iterated Updates in Abstract Argumentation
Fixpoints play a key role in the mathematical set up of abstract argumentation theory but, we argue, have been relatively underexamined in the literature. The paper studies the logical structure underlying the computation via approximation sequences of the sort of fixpoints relevant in argumentation. Concretely, it presents a number of novel results on the fixed point theory underpinning the ma...
متن کاملOn Propositional Knowledge Base Updates
It is well known that the minimal change principle was widely used in propositional knowledge base updates. However, recent research has shown that under some circumstances, the conventional minimal change methods were inappropriate for updating knowledge bases with disjunctive eeects. In this paper we propose a new method for the knowledge base update based on a persistence principle, which pr...
متن کاملSecure dissemination of software updates for intelligent mobility in future wireless networks
Wireless mobile networks frequently need remote software updates to add or adjust the tasks of mobile nodes. Software update traffic, particularly in the Internet of Things (IoT), should be carefully handled since attackers can easily compromise a number of unattended devices by modifying a piece of code in the software update routine. These attacks are quite realistic and harmful as seen in th...
متن کاملThe Stable Closure Semantics for Active Knowledge Bases
Active knowledge bases result from the addition of action rules to ordinary knowledge bases, like relational or deductive databases and their (for instance, disjunctive) extensions. Action rules provide, e.g., for knowledge base updates on certain conditions, thus beeing able to enforce integrity constraints. But they can also call procedures, like running certain diagnostic tests, or turning s...
متن کاملUpdating Knowledge Bases Using a Persistent Set Approach
Propositional knowledge base updates have been widely studied recently. Kat-suno and Mendelzon suggested eight postulates for characterizing the semantics of update where the principle of minimal change is embedded 5]. In this paper we propose a new method for knowledge base update called the persistent set approach (PSA). We examine the relations between the two diierent update semantics by in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 9 شماره
صفحات -
تاریخ انتشار 1999